SDME Quality Measure based Stopping Criteria for Iterative Deblurring Algorithms
نویسندگان
چکیده
منابع مشابه
SDME Quality Measure based Stopping Criteria for Iterative Deblurring Algorithms
Deblurring from motion problem with or without noise is ill-posed inverse problem and almost all inverse problem require some sort of parameter selection. Quality of restored image in iterative motion deblurring is dependent on optimal stopping point or regularization parameter selection. At optimal point reconstructed image is best matched to original image and for other points either data mis...
متن کاملTiming Models and Local Stopping Criteria for Asynchronous Iterative Algorithms
Asynchronous iterative algorithms can reduce much of the data dependencies associated with synchronization barriers. The reported study investigates the potentials of asynchronous iterative algorithms by quantifying the critical parallel processing factors. Specifically, a time complexity-based analysis method is used to understand the inherent interdependencies between computing and communicat...
متن کاملNew stopping criteria for iterative root finding
A set of simple stopping criteria is presented, which improve the efficiency of iterative root finding by terminating the iterations immediately when no further improvement of the roots is possible. The criteria use only the function evaluations already needed by the root finding procedure to which they are applied. The improved efficiency is achieved by formulating the stopping criteria in ter...
متن کاملIterative regularization algorithms for constrained image deblurring on graphics processors
The ability of the modern graphics processors to operate on large matrices in parallel can be exploited for solving constrained image deblurring problems in a short time. In particular, in this paper we propose the parallel implementation of two iterative regularization methods: the well known expectation maximization algorithm and a recent scaled gradient projection method. The main difference...
متن کاملStopping Criteria for the Iterative Solution of Linear Least Squares
We explain an interesting property of minimum residual iterative methods for the solution of the linear least squares (LS) problem. Our analysis demonstrates that the stopping criteria commonly used with these methods can in some situations be too conservative, causing any chosen method to perform too many iterations or even fail to detect that an acceptable iterate has been obtained. We propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2016
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2016.071027